Finding the Best Way with Dynamic Programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding the Best Way to Join in ? –A Dynamic Accession Game–

In this paper we define and solve the accession game, a dynamic game with a per-member partition function that satisfies a set of conditions as used by Yi [14] containing a union and a set of applicants. The solution gives an equilibrium partition of the players as well as, after Morelli and Penelle [9], the optimal path to it, a subgame-perfect sequence of partitions, where each player maximis...

متن کامل

Diverse M-Best Solutions by Dynamic Programming

Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a treeshaped probabilistic graphical model. In such cases, extracting not merely the best, but the set of M-best solutions is useful to generate a rich collection of candidate proposals that can be used in downstream processing. In this work, we show how M-best...

متن کامل

Finding Optimal Bayesian Networks by Dynamic Programming

Finding the Bayesian network that maximizes a score function is known as structure learning or structure discovery. Most approaches use local search in the space of acyclic digraphs, which is prone to local maxima. Exhaustive enumeration requires super-exponential time. In this paper we describe a "merely" exponential space/time algorithm for finding a Bayesian network that corresponds to a glo...

متن کامل

Finding optimal Bayesian networks by dynamic programming

Finding the Bayesian network that maximizes a score function is known as structure learning or structure discovery. Most approaches use local search in the space of acyclic digraphs, which is prone to local maxima. Exhaustive enumeration requires super-exponential time. In this paper we describe a “merely” exponential space/time algorithm for finding a Bayesian network that corresponds to a glo...

متن کامل

A DSS-Based Dynamic Programming for Finding Optimal Markets Using Neural Networks and Pricing

One of the substantial challenges in marketing efforts is determining optimal markets, specifically in market segmentation. The problem is more controversial in electronic commerce and electronic marketing. Consumer behaviour is influenced by different factors and thus varies in different time periods. These dynamic impacts lead to the uncertain behaviour of consumers and therefore harden the t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Impact

سال: 2016

ISSN: 2058-802X,2058-8038

DOI: 10.1080/2058802x.2016.11964011